Optimal clock synchronization
نویسندگان
چکیده
منابع مشابه
An Optimal Internal Clock Synchronization Algorithm
We propose an optimal convergence function for achieving fault-tolerant, internal clock synchroniza, tion in the presence of arbitrary process and clock failures. The diflerential fault-tolerant midpoint convergence function guarantees an optimal maximum correction, an optimal maximum drift rate, and an optimal maximum deviation. The proposed convergence function is simple and easy to compute. ...
متن کاملOptimal Clock Synchronization with Bounded Rates
We present a novel clock synchronization algorithm and prove that this algorithm achieves an essentially optimal upper bound on the worst-case clock skew between any two participants in any given distributed system. More importantly, the clock skew that can occur in the worst case between neighboring participants is (asymptotically) at most a factor of two larger than the best possible bound. F...
متن کاملOptimal Clock Synchronization under Different Delay Assumptions
The problem of achieving optimal clock synchronization in a communication network with arbitrary topology and perfect clocks (that do not drift) is studied. Clock synchronization algorithms are presented for a large family of delay assumptions. Our algorithms are modular and consist of three major components. The first component holds for any type of delay assumptions; the second component hold...
متن کاملClock Synchronization
When Charles V retired in weariness from the greatest throne in the world to the solitude of the monastery at Yuste, he occupied his leisure for some weeks trying to regulate two clocks. It proved very difficult. One day, it is recorded, he turned to his assistant and said: “To think that I attempted to force the reason and conscience of thousands of men into one mould, and I cannot make two cl...
متن کاملOptimal Gradient Clock Synchronization in Dynamic Networks (Technical Report)
We study the problem of clock synchronization in highly dynamic networks, where communication links can appear or disappear at any time. The nodes in the network are equipped with hardware clocks, but the rate of the hardware clocks can vary arbitrarily within specific bounds, and the estimates that nodes can obtain about the clock values of other nodes are inherently inaccurate. Our goal in th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 1987
ISSN: 0004-5411,1557-735X
DOI: 10.1145/28869.28876